Characterization of the probabilistic traveling salesman problem

Characterization of the probabilistic traveling salesman problem.

We show that stochastic annealing can be successfully applied to gain new results on the probabilistic traveling salesman problem. The probabilistic "traveling salesman" must decide on an a priori order in which to visit n cities (randomly distributed over a unit square) before learning that some cities can be omitted. We find the optimized average length of the pruned tour follows E(L(pruned))...

Probabilistic analysis of the Traveling Salesman Problem

Aggregation for the probabilistic traveling salesman problem

5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowest expected final tour cost. The PTSP is an important 7 problem, both operationally and strategically, but is quite difficult to solve with realistically sized problem instances. One alternative is to aggregate custome...

Probabilistic Traveling Salesman Problem with Deadlines

Time-constrained deliveries are one of the fastest growing segments of the delivery business, and yet, there is surprisingly little literature that addresses time constraints in the context of stochastic customer presence. We begin to fill that void by introducing the probabilistic traveling salesman problem with deadlines (PTSPD). The PTSPD is an extension of the well-known probabilistic trave...

The traveling salesman problem